Augmented Lagrangian methods for degenerate Hamilton–Jacobi equations
نویسندگان
چکیده
We suggest a new approach to solve class of degenerate Hamilton–Jacobi equations without any assumptions on the emptiness Aubry set. It is based characterization maximal subsolution by means Fenchel–Rockafellar duality. This enables us use augmented Lagrangian methods as alternatives commonly used for numerical approximation solution, finite difference or optimal control interpretation solution.
منابع مشابه
Practical Augmented Lagrangian Methods
for all x ∈ IR, λ ∈ IR, μ ∈ IR +. PHR-based Augmented Lagrangian methods for solving (1) are based on the iterative (approximate) minimization of Lρ with respect to x ∈ Ω, followed by the updating of the penalty parameter ρ and the Lagrange multipliers approximations λ and μ. The most popular practical Augmented Lagrangian method gave rise to the Lancelot package [24, 25, 26]. Lancelot does not...
متن کاملAugmented Lagrangian Methods for Transport Optimization, Mean-field Games and Degenerate Pdes
Many problems from mass transport can be reformulated as variational problems under a prescribed divergence constraint (static problems) or subject to a time dependent continuity equation which again is a divergence constraint but in time and space. A large class of Mean-Field Games introduced by Lasry and Lions may also be interpreted as a generalisation of the time-dependent optimal transport...
متن کاملInexact accelerated augmented Lagrangian methods
The augmented Lagrangian method is a popular method for solving linearly constrained convex minimization problem and has been used many applications. In recently, the accelerated version of augmented Lagrangian method was developed. The augmented Lagrangian method has the subproblem and dose not have the closed form solution in general. In this talk, we propose the inexact version of accelerate...
متن کاملAugmented Lagrangian methods for variational inequality problems
We introduce augmented Lagrangian methods for solving finite dimensional variational inequality problems whose feasible sets are defined by convex inequalities, generalizing the proximal augmented Lagrangian method for constrained optimization. At each iteration, primal variables are updated by solving an unconstrained variational inequality problem, and then dual variables are updated through ...
متن کاملAugmented Lagrangian Methods and Proximal Point Methods for Convex Optimization
We present a review of the classical proximal point method for nding zeroes of maximal monotone operators, and its application to augmented Lagrangian methods, including a rather complete convergence analysis. Next we discuss the generalized proximal point methods, either with Bregman distances or -divergences, which in turn give raise to a family of generalized augmented Lagrangians, as smooth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calculus of Variations and Partial Differential Equations
سال: 2021
ISSN: ['0944-2669', '1432-0835']
DOI: https://doi.org/10.1007/s00526-021-02092-5